Joint replenishment meets scheduling

Abstract In this paper, we consider a combination of the joint replenishment problem (JRP) and single-machine scheduling with release dates. There is single machine one or more item types. Each job has date, positive processing time, it requires subset items. A can be started at time t only if all required types were replenished between date point . The ordering for distinct jobs combined. objective to minimize total cost plus criterion, such as weighted completion maximum flow where items simultaneously sum cost, an additional each type in subset. We provide several complexity results offline problem, competitive analysis online variants min–sum min–max criteria, respectively.